CONGRUENCES MODULO SQUARES OF PRIMES FOR FU’S k DOTS BRACELET PARTITIONS

Abstract. In 2007, Andrews and Paule introduced the family of functions ∆k(n) which enumerate the number of broken k–diamond partitions for a fixed positive integer k. In that paper, Andrews and Paule proved that, for all n ≥ 0, ∆1(2n + 1) ≡ 0 (mod 3) using a standard generating function argument. Soon after, Shishuo Fu provided a combinatorial proof of this same congruence. Fu also utilized this combinatorial approach to naturally define a generalization of broken k–diamond partitions which he called k dots bracelet partitions. He denoted the number of k dots bracelet partitions of n by Bk(n) and proved various congruence properties for these functions modulo primes and modulo powers of 2. In this note, we extend the set of congruences proven by Fu by proving the following congruences: For all n ≥ 0, B5(10n + 7) ≡ 0 (mod 5), B7(14n + 11) ≡ 0 (mod 7), and B11(22n + 21) ≡ 0 (mod 11)